Orthogonal projections onto convex sets and the application to problems in plasticity
نویسندگان
چکیده
We review the classical theory of static and quasi-static plasticity in an abstract framework of convex analysis. It can be shown that the extended use of orthogonal projections onto closed convex sets simplifies the analysis substantially. We present new characterizations of the primal problem in plasticity. The abstract setting is applied to problems in perfect plasticity and to plasticity with nonlinear hardening. Furthermore, our approach leads to a better understanding of the radial return algorithm which is commonly used in computational plasticity. We study the fundamental role of orthogonal projections in plasticity in an abstract framework of convex analysis. This is the key to the mathematical understanding of the radial return algorithm and the consistent tangent operator introduced by SIMO-TAYLOR [16]. In this abstract framework, the basic results in TEMAM [17] for static perfect plasticity become clearer and can be applied to computational plasticity, and we derive a new characterization of the primal problem. We obtain the quasi-static formulation of plasticity as the limit of increments, where every time increment corresponds to a static problem. Then, the quasi-static problem is studied as a dissipative evolution equation. This is a unified and simplified framework which can be applied to more general problems such as the coupling of plasticity and friction or contact. In addition, this presentation allows a simple analysis of the limit problem. The analytical core of the quasi-static analysis is the observation that the resolvent of the subdifferential of the indicator function of a closed convex set coincides with the orthogonal projection. The main difference between our proof and the arguments given in DUVAUT-LIONS [6] is the consequent use of the orthogonal projection and its properties. Furthermore, our approach formalizes quasi-static plasticity in the context of maximal monotone operators as it is considered for the dynamic case in ALBER [1]; in particular, this makes the theory of the transformation of internal variables available to the quasi-static setting. 1991 Mathematics Subject Classification. 73E50.
منابع مشابه
Modelling Decision Problems Via Birkhoff Polyhedra
A compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. Directed Hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. Sets of extrema of Birkhoff polyhedra are mapped to tours ...
متن کاملProjection Onto Convex Sets ( POCS ) Based Signal Reconstruction Framework with an associated cost function
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملSignal Reconstruction Framework Based On Projections Onto Epigraph Set Of A Convex Cost Function (PESC)
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملOnline adaptive decision fusion framework based on projections onto convex sets with application to wildfire detection in video
In this paper, an online adaptive decision fusion framework is developed for image analysis and computer vision applications. In this framework, it is assumed that the compound algorithm consists of several sub-algorithms, each of which yields its own decision as a real number centered around zero, representing the confidence level of that particular sub-algorithm. Decision values are linearly ...
متن کاملStrong convergence theorem for a class of multiple-sets split variational inequality problems in Hilbert spaces
In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.
متن کامل